Computing a pyramid partition generating function with dimer shuffling
نویسندگان
چکیده
منابع مشابه
Computing a pyramid partition generating function with dimer shuffling
Abstract. We verify a recent conjecture of Kenyon/Szendrői by computing the generating function for pyramid partitions. Pyramid partitions are closely related to Aztec Diamonds; their generating function turns out to be the partition function for the Donaldson–Thomas theory of a non-commutative resolution of the conifold singularity {x1x2 −x3x4 = 0} ⊂ C. The proof does not require algebraic geo...
متن کاملThe Dimer Partition Function
We apply the Ginzburg criterion to the dimer problem and we solve the apparent contradiction of a system with mean field α = 12 , the typical value of tricritical systems, and upper critical dimension Dcr = 6. We find that the system has upper critical dimensionDcr = 6 , while for D ≤ 4 it should undergo a first order phase transition. We comment on the latter wrong result examining the approxi...
متن کاملPartition function of periodic isoradial dimer models
Isoradial dimer models were introduced in Kenyon (Invent Math 150(2):409–439, 2002)— they consist of dimer models whose underlying graph satisfies a simple geometric condition, and whose weight function is chosen accordingly. In this paper, we prove a conjecture of (Kenyon in Invent Math 150(2):409–439, 2002), namely that for periodic isoradial dimer models, the growth rate of the toroidal part...
متن کاملComputing the integer partition function
In this paper we discuss efficient algorithms for computing the values of the partition function and implement these algorithms in order to conduct a numerical study of some conjectures related to the partition function. We present the distribution of p(N) for N ≤ 109 for primes up to 103 and small powers of 2 and 3.
متن کاملComputing the partition function for graph homomorphisms
We introduce the partition function of edge-colored graph homomorphisms, of which the usual partition function of graph homomorphisms is a specialization, and present an efficient algorithm to approximate it in a certain domain. Corollaries include efficient algorithms for computing weighted sums approximating the number of k-colorings and the number of independent sets in a graph, as well as a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2009
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2008.06.006